Reversal complexity revisited
نویسندگان
چکیده
منابع مشابه
Reversal complexity revisited
We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several further tapes on which head reversals remain unrestricted, but size is bounded by s(n) (where n denotes the input length). Recently [9,10], such machines were introduced as a formalization of a computation model that restr...
متن کاملThe hand-reversal illusion revisited
The hand-reversal illusion is a visuomotor illusion that is commonly seen in children's play. When participants attempt to lift a designated finger while their hands are cross-folded, they are likely to erroneously lift the matched finger of the other hand; however, such errors are rare when subjects close their eyes. Based on the fact that the illusion disappears without visual input, research...
متن کاملReversal-Bounded Counter Machines Revisited
We extend the class of reversal-bounded counter machines by authorizing a finite number of alternations between increasing and decreasing mode over a given bound. We prove that extended reversal-bounded counter machines also have effective semi-linear reachability sets. We also prove that the property of being reversal-bounded is undecidable in general even when we fix the bound, whereas this p...
متن کاملAverage Case Complexity, Revisited
More than two decades elapsed since Levin set forth a theory of average-case complexity. In this survey we present the basic aspects of this theory as well as some of the main results regarding it. The current presentation deviates from our old “Notes on Levin’s Theory of Average-Case Complexity” (ECCC, TR97-058, 1997) in several aspects.
متن کاملComplexity Spaces Revisited
The complexity (quasi-pseudo-metric) spaces have been introduced as part of the development of a topological foundation for the complexity analysis of algorithms ((Sch95]). Applications of this theory to the complexity analysis of Divide & Conquer algorithms have been discussed in Sch95]. Typically these applications involve xed point arguments based on the Smyth completion. The notion of S-com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2008
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.04.026